Parameterisation for abstract structured specifications
نویسندگان
چکیده
منابع مشابه
Meta-Proof for Structured Specifications
We are working on a practical, template-based approach to the formalisation of object-oriented models. In previous papers, which demonstrate the approach, we have asserted that the formal proofs required for consistency checking and analysis of the model, are also amenable to a template-based solution, using modular metaproofs. In this paper, we explain the meta-proof concept, and illustrate it...
متن کاملAbstract Specifications for Concurrent Maps
Specifications for Concurrent Maps (Extended Version) Shale Xiong, Pedro da Rocha Pinto, Gian Ntzik, and Philippa Gardner Imperial College London, UK {sx14,pmd09,gn408,pg}@ic.ac.uk Abstract. Despite recent advances in reasoning about concurrent data structure libraries, the largest implementations in java.util.concurrent have yet to be verified. The key issue lies in the development of modular ...
متن کاملLogical systems for structured specifications
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wir 91]. Following Goguen and Burstall, the notion of an underlying logical system over which we build specifications is formalized as an institution and extended to a more general notion, called (D, T )-institution. We ...
متن کاملDevelopment graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work, we extend development graphs with hiding (e.g. hidden operations). Hiding is a particularly difficult to realize operation, since it does not admit such a good decomposition of the involved specifications as other st...
متن کاملStructured language for specifications of quantitative requirements
Requirements for dependable systems need to be understandable and, at the same time, have to satisfy consistency and unambiguity properties. We provide a means to specify nonfunctional requirements in terms of structured English sentences. We define their the syntax by a clear and consistent notation. For verification these sentences have to be transformed to a notation that can be interpreted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.008